CRT Based Threshold Multi Secret Sharing Scheme

This paper presents a novel secret sharing system that is based on Chinese remainder theorem. This scheme deals with a concept of multiple secrets to be shared to different groups, such that each group receives shares of secret intended for it. The sharing is a threshold scheme, that is more than a fixed number of members from any particular group, will be able to reconstruct the secret and any smaller set will not be able to know what it is. Resource requirements here are not very high as in other cryptography schemes and is suitable for resource constrained environment for establishing session key or any such random secrets which they can use for short time.